From Distributions to Probabilistic Reactive Programs
نویسندگان
چکیده
We have introduced probability in the UTP framework by using functions from the state space to real numbers, which we term distributions, that are embedded in the predicates describing the different program constructs. This has allowed us to derive a probabilistic theory of designs starting from a probabilistic version of the relational theory, and continuing further down this road we can get to a theory of probabilistic reactive programs. This paper presents the route that connects these steps, and discusses the challenges lying ahead in view of a probabilistic CSP based on distributions.
منابع مشابه
Probabilistic Multi Objective Optimal Reactive Power Dispatch Considering Load Uncertainties Using Monte Carlo Simulations
Optimal Reactive Power Dispatch (ORPD) is a multi-variable problem with nonlinear constraints and continuous/discrete decision variables. Due to the stochastic behavior of loads, the ORPD requires a probabilistic mathematical model. In this paper, Monte Carlo Simulation (MCS) is used for modeling of load uncertainties in the ORPD problem. The problem is formulated as a nonlinear constrained mul...
متن کاملAutomated Variational Inference in Probabilistic Programming
We present a new algorithm for approximate inference in probabilistic programs, based on a stochastic gradient for variational programs. This method is efficient without restrictions on the probabilistic program; it is particularly practical for distributions which are not analytically tractable, including highly structured distributions that arise in probabilistic programs. We show how to auto...
متن کاملAn application of computable distributions to the semantics of probabilistic programs
In this extended abstract, we give semantics to a core functional probabilistic programming language (PCF with pairs) based on computable distributions. Type-2 computable distributions admit Type-2 computable sampling procedures. Informally, this means that we can sample from every computable distribution using a sampling algorithm that operates on input bit-randomness (e.g., a stream of fair c...
متن کاملOn Probabilistic Program Equivalence and Refinement
We study notions of equivalence and refinement for probabilistic programs formalized in the second-order fragment of Probabilistic Idealized Algol. Probabilistic programs implement randomized algorithms: a given input yields a probability distribution on the set of possible outputs. Intuitively, two programs are equivalent if they give rise to identical distributions for all inputs. We show tha...
متن کاملCoarse-to-Fine Sequential Monte Carlo for Probabilistic Programs
Many practical techniques for probabilistic inference require a sequence of distributions that interpolate between a tractable distribution and an intractable distribution of interest. Usually, the sequences used are simple, e.g., based on geometric averages between distributions. When models are expressed as probabilistic programs, the models themselves are highly structured objects that can b...
متن کامل